Multi-agent Systems as Concurrent Constraint Processes
نویسندگان
چکیده
We present a language Scc for a speciication of the direct exchange and/or the global sharing of information in multi-agent systems. Scc is based on concurrent constraint programming paradigm which we modify in such a way that agents can (i) maintain its local private store, (ii) share (read/write) the information in the global store and (iii) communicate with other agents (via multi-party or handshake). To justify our proposal we compare Scc to a recently proposed language for the exchange of information in multi-agent systems. Also we provide an operational semantics of Scc. The full semantic treatment is sketched only and done elsewhere.
منابع مشابه
Temporal Concurrent Constraint Programming: Denotation, Logic and Applications
The tcc model is a formalism for reactive concurrent constraint programming. We present a model of temporal concurrent constraint programming which adds to tcc the capability of modeling asynchronous and nondeterministic timed behavior. We call this tcc extension the ntcc calculus. We also give a denotational semantics for the strongestpostcondition of ntcc processes and, based on this semantic...
متن کاملA fully abstract model for the exchange of information in multi-agent systems
In this paper, we present a semantic theory for the exchange of information in multi-agent systems. We consider the multi-agent programming language agent communication programming language, which integrates the paradigms of concurrent constraint programming and communicating sequential processes (CSP). The constraint programming techniques are used to represent and process information, whereas...
متن کاملLattices for Space/Belief and Extrusion/Utterance
The notion of constraint system (cs) is central to declarative programming formalisms such as concurrent constraint programming (ccp) and constraint logic programming (clp). Constraint systems are often represented as lattices: their elements, called constraints, represent partial information and their order corresponds to entailment. Recently a notion of (n-agent) spatial cs was introduced to ...
متن کاملProcess Algebra for Agent Communication: A General Semantic Approach
In this paper, we consider the process algebra ACPL, which models the basics of agent communication. This algebra combines the informationprocessing aspects of Concurrent Constraint Programming (CCP) with a generalisation of the synchronous handshaking communication mechanism of Communicating Sequential Processes (CSP). The operational semantics of ACPL is given in terms of a transition system ...
متن کاملBelief, knowledge, lies and other utterances in an algebra for space and extrusion
The notion of constraint system (cs) is central to declarative formalisms from concurrency theory such as process calculi for concurrent constraint programming (ccp). Constraint systems are often represented as lattices: their elements, called constraints, represent partial information and their order corresponds to entailment. Recently a notion of n-agent spatial cs was introduced to represent...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001